Search Results

Documents authored by Roy, Marie-Françoise

Found 2 Possible Name Variants:

Roy, Marie-Françoise

Document
DOI: 10.4230/DagSemProc.05021.1
05021 Abstracts Collection – Mathematics, Algorithms, Proofs

Authors: Thierry Coquand, Henri Lombardi, and Marie-Françoise Roy

Published in: Dagstuhl Seminar Proceedings, Volume 5021, Mathematics, Algorithms, Proofs (2006)

Abstract
From 09.01.05 to 14.01.05, the Dagstuhl Seminar 05021 ``Mathematics, Algorithms, Proofs'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. LinkstFo extended abstracts or full papers are provided, if available.
Cite as

Thierry Coquand, Henri Lombardi, and Marie-Françoise Roy. 05021 Abstracts Collection – Mathematics, Algorithms, Proofs. In Mathematics, Algorithms, Proofs. Dagstuhl Seminar Proceedings, Volume 5021, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{coquand_et_al:DagSemProc.05021.1,
  author =	{Coquand, Thierry and Lombardi, Henri and Roy, Marie-Fran\c{c}oise},
  title =	{{05021 Abstracts Collection – Mathematics, Algorithms, Proofs}},
  booktitle =	{Mathematics, Algorithms, Proofs},
  pages =	{1--15},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{5021},
  editor =	{Thierry Coquand and Henri Lombardi and Marie-Fran\c{c}oise Roy},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05021.1},
  URN =		{urn:nbn:de:0030-drops-3038},
  doi =		{10.4230/DagSemProc.05021.1},
  annote =	{Keywords: Constructive mathematics, computer algebra, proof systems}
}
Document
DOI: 10.4230/DagSemProc.05021.20
Subdiscriminant of symmetric matrices are sums of squares

Authors: Marie-Françoise Roy

Published in: Dagstuhl Seminar Proceedings, Volume 5021, Mathematics, Algorithms, Proofs (2006)

Abstract
We present a very elementary algebraic proof providing an explicit sum of squares. This result generalizes a result on discriminants of symmetric matrices due to Ilyushechkin and proved also by P. Lax.
Cite as

Marie-Françoise Roy. Subdiscriminant of symmetric matrices are sums of squares. In Mathematics, Algorithms, Proofs. Dagstuhl Seminar Proceedings, Volume 5021, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{roy:DagSemProc.05021.20,
  author =	{Roy, Marie-Fran\c{c}oise},
  title =	{{Subdiscriminant of symmetric matrices are sums of squares}},
  booktitle =	{Mathematics, Algorithms, Proofs},
  pages =	{1--4},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{5021},
  editor =	{Thierry Coquand and Henri Lombardi and Marie-Fran\c{c}oise Roy},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05021.20},
  URN =		{urn:nbn:de:0030-drops-3471},
  doi =		{10.4230/DagSemProc.05021.20},
  annote =	{Keywords: Real algebra, sums of squares, subdiscriminants}
}
Document
DOI: 10.4230/DagSemRep.362
Verification and Constructive Algebra (Dagstuhl Seminar 03021)

Authors: Thierry Coquand, Henri Lombardi, and Marie-Françoise Roy

Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)

Abstract
Cite as

Thierry Coquand, Henri Lombardi, and Marie-Françoise Roy. Verification and Constructive Algebra (Dagstuhl Seminar 03021). Dagstuhl Seminar Report 362, pp. 1-17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2004)

Copy BibTex To Clipboard

@TechReport{coquand_et_al:DagSemRep.362,
  author =	{Coquand, Thierry and Lombardi, Henri and Roy, Marie-Fran\c{c}oise},
  title =	{{Verification and Constructive Algebra (Dagstuhl Seminar 03021)}},
  pages =	{1--17},
  ISSN =	{1619-0203},
  year =	{2004},
  type = 	{Dagstuhl Seminar Report},
  number =	{362},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemRep.362},
  URN =		{urn:nbn:de:0030-drops-152425},
  doi =		{10.4230/DagSemRep.362},
}
Document
DOI: 10.4230/DagSemRep.214
Real Computation and Complexity (Dagstuhl Seminar 98241)

Authors: Felipe Cucker, Thomas Lickteig, Marie-Francoise Roy, and Michael Shub

Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)

Abstract
Cite as

Felipe Cucker, Thomas Lickteig, Marie-Francoise Roy, and Michael Shub. Real Computation and Complexity (Dagstuhl Seminar 98241). Dagstuhl Seminar Report 214, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (1999)

Copy BibTex To Clipboard

@TechReport{cucker_et_al:DagSemRep.214,
  author =	{Cucker, Felipe and Lickteig, Thomas and Roy, Marie-Francoise and Shub, Michael},
  title =	{{Real Computation and Complexity (Dagstuhl Seminar 98241)}},
  pages =	{1--15},
  ISSN =	{1619-0203},
  year =	{1999},
  type = 	{Dagstuhl Seminar Report},
  number =	{214},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemRep.214},
  URN =		{urn:nbn:de:0030-drops-151006},
  doi =		{10.4230/DagSemRep.214},
}

Roy, Marie-Francoise

Document
DOI: 10.4230/DagSemProc.05021.1
05021 Abstracts Collection – Mathematics, Algorithms, Proofs

Authors: Thierry Coquand, Henri Lombardi, and Marie-Françoise Roy

Published in: Dagstuhl Seminar Proceedings, Volume 5021, Mathematics, Algorithms, Proofs (2006)

Abstract
From 09.01.05 to 14.01.05, the Dagstuhl Seminar 05021 ``Mathematics, Algorithms, Proofs'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. LinkstFo extended abstracts or full papers are provided, if available.
Cite as

Thierry Coquand, Henri Lombardi, and Marie-Françoise Roy. 05021 Abstracts Collection – Mathematics, Algorithms, Proofs. In Mathematics, Algorithms, Proofs. Dagstuhl Seminar Proceedings, Volume 5021, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{coquand_et_al:DagSemProc.05021.1,
  author =	{Coquand, Thierry and Lombardi, Henri and Roy, Marie-Fran\c{c}oise},
  title =	{{05021 Abstracts Collection – Mathematics, Algorithms, Proofs}},
  booktitle =	{Mathematics, Algorithms, Proofs},
  pages =	{1--15},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{5021},
  editor =	{Thierry Coquand and Henri Lombardi and Marie-Fran\c{c}oise Roy},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05021.1},
  URN =		{urn:nbn:de:0030-drops-3038},
  doi =		{10.4230/DagSemProc.05021.1},
  annote =	{Keywords: Constructive mathematics, computer algebra, proof systems}
}
Document
DOI: 10.4230/DagSemProc.05021.20
Subdiscriminant of symmetric matrices are sums of squares

Authors: Marie-Françoise Roy

Published in: Dagstuhl Seminar Proceedings, Volume 5021, Mathematics, Algorithms, Proofs (2006)

Abstract
We present a very elementary algebraic proof providing an explicit sum of squares. This result generalizes a result on discriminants of symmetric matrices due to Ilyushechkin and proved also by P. Lax.
Cite as

Marie-Françoise Roy. Subdiscriminant of symmetric matrices are sums of squares. In Mathematics, Algorithms, Proofs. Dagstuhl Seminar Proceedings, Volume 5021, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{roy:DagSemProc.05021.20,
  author =	{Roy, Marie-Fran\c{c}oise},
  title =	{{Subdiscriminant of symmetric matrices are sums of squares}},
  booktitle =	{Mathematics, Algorithms, Proofs},
  pages =	{1--4},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{5021},
  editor =	{Thierry Coquand and Henri Lombardi and Marie-Fran\c{c}oise Roy},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.05021.20},
  URN =		{urn:nbn:de:0030-drops-3471},
  doi =		{10.4230/DagSemProc.05021.20},
  annote =	{Keywords: Real algebra, sums of squares, subdiscriminants}
}
Document
DOI: 10.4230/DagSemRep.362
Verification and Constructive Algebra (Dagstuhl Seminar 03021)

Authors: Thierry Coquand, Henri Lombardi, and Marie-Françoise Roy

Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)

Abstract
Cite as

Thierry Coquand, Henri Lombardi, and Marie-Françoise Roy. Verification and Constructive Algebra (Dagstuhl Seminar 03021). Dagstuhl Seminar Report 362, pp. 1-17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2004)

Copy BibTex To Clipboard

@TechReport{coquand_et_al:DagSemRep.362,
  author =	{Coquand, Thierry and Lombardi, Henri and Roy, Marie-Fran\c{c}oise},
  title =	{{Verification and Constructive Algebra (Dagstuhl Seminar 03021)}},
  pages =	{1--17},
  ISSN =	{1619-0203},
  year =	{2004},
  type = 	{Dagstuhl Seminar Report},
  number =	{362},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemRep.362},
  URN =		{urn:nbn:de:0030-drops-152425},
  doi =		{10.4230/DagSemRep.362},
}
Document
DOI: 10.4230/DagSemRep.214
Real Computation and Complexity (Dagstuhl Seminar 98241)

Authors: Felipe Cucker, Thomas Lickteig, Marie-Francoise Roy, and Michael Shub

Published in: Dagstuhl Seminar Reports. Dagstuhl Seminar Reports, Volume 1 (2021)

Abstract
Cite as

Felipe Cucker, Thomas Lickteig, Marie-Francoise Roy, and Michael Shub. Real Computation and Complexity (Dagstuhl Seminar 98241). Dagstuhl Seminar Report 214, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (1999)

Copy BibTex To Clipboard

@TechReport{cucker_et_al:DagSemRep.214,
  author =	{Cucker, Felipe and Lickteig, Thomas and Roy, Marie-Francoise and Shub, Michael},
  title =	{{Real Computation and Complexity (Dagstuhl Seminar 98241)}},
  pages =	{1--15},
  ISSN =	{1619-0203},
  year =	{1999},
  type = 	{Dagstuhl Seminar Report},
  number =	{214},
  institution =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemRep.214},
  URN =		{urn:nbn:de:0030-drops-151006},
  doi =		{10.4230/DagSemRep.214},
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact